Degenerate Quantum LDPC Codes With Good Finite Length Performance
نویسندگان
چکیده
We study the performance of medium-length quantum LDPC (QLDPC) codes in depolarizing channel. Only degenerate with maximal stabilizer weight much smaller than their minimum distance are considered. It is shown that help OSD-like post-processing standard belief propagation (BP) decoder on many QLDPC can be improved by several orders magnitude. Using this new BP-OSD we known classes including hypergraph product codes, hyperbicycle homological and Haah's cubic codes. also construct interesting examples short generalized bicycle Some them have an additional property syndromes protected small BCH which may useful for fault-tolerant syndrome measurement. propose a large family contains class where one used parity-check matrices square. some cases such better Finally, demonstrate proposed constructed relatively surface code decoded near-optimal decoder.
منابع مشابه
Notes: Finite-length Protograph-based Spatially Coupled LDPC Codes
The finite-length performance of multi-edge spatially coupled low-density parity-check (SC-LDPC) codes is analyzed over the binary erasure channel (BEC). Existing scaling laws are extended to arbitrary protograph base matrices including puncturing patterns and multiple edges between nodes. Compared to more involved rate-1/2 structures proposed to improve the threshold to minimum distance trade-...
متن کاملAsymptotic and Finite-length Optimization of Ldpc Codes
This thesis addresses the problem of information transmission over noisy channels. In 1993, Berrou, Glavieux and Thitimajshima discovered Turbo-codes. These codes made it possible to achieve a very good performance at low decoding complexity. In hindsight, it was recognized that the underlying principle of using sparse graph codes in conjunction with message-passing decoding was the same as the...
متن کاملImproving the Finite-Length Performance of Spatially Coupled LDPC Codes by Connecting Multiple Code Chains
In this paper, we analyze the finite-length performance of codes on graphs constructed by connecting spatially coupled low-density parity-check (SC-LDPC) code chains. Successive (peeling) decoding is considered for the binary erasure channel (BEC). The evolution of the undecoded portion of the bipartite graph remaining after each iteration is analyzed as a dynamical system. When connecting shor...
متن کاملPerformance Bound for Finite-Length LDPC Coded Modulation
Coded modulation systems based on low density parity check (LDPC) codes of finite lengths are considered. The union bounds on the bit error probabilities of the maximum likelihood (ML) decoding are presented for both additive white Gaussian noise (AWGN) and flat Rayleigh fading channels. The tightness of the derived bound is verified by simulating the ML decoding of a very short LDPC code. For ...
متن کاملConstructions and performance of classes of quantum LDPC codes
Two methods for constructing quantum LDPC codes are presented. We explain how to overcome the difficulty of finding a set of low weight generators for the stabilizer group of the code. Both approaches are based on some graph representation of the generators of the stabilizer group and on simple local rules that ensure commutativity. A message passing algorithm for generic quantum LDPC codes is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum
سال: 2021
ISSN: ['2521-327X']
DOI: https://doi.org/10.22331/q-2021-11-22-585